Optimization algorithms for transportation problems with stochastic demand
نویسندگان
چکیده
The purpose of this paper is to solve the stochastic demand for unbalanced transport problem using heuristic algorithms obtain optimum solution, by minimizing costs transporting gasoline product Oil Products Distribution Company Iraqi Ministry Oil. most important conclusions that were reached are results prove possibility solving random transportation when uncertain programming model. obvious finding emerge from work genetic algorithm was able address problems transport, And applying model approved oil products distribution company in minimize total costs, Where 25%. A future study investigating optimization with stochastics would be very interesting.
منابع مشابه
Algorithms Column: Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Uncertainty is a facet of many decision environments and might arise for various reasons, such as unpredictable information revealed in the future, or inherent fluctuations caused by noise. Stochastic optimization provides a means to handle uncertainty by modeling it by a probability distribution over possible realizations of the actual data, called scenarios. The field of stochastic optimizati...
متن کاملApproximation Algorithms for Stochastic Optimization Problems in Operations Management
This article provides an introduction to approximation algorithms in stochastic optimization models arising in various application domains, including central areas of operations management, such as scheduling, facility location, vehicle routing problems, inventory and supply chain management and revenue management. Unfortunately, these models are very hard to solve to optimality both in theory ...
متن کاملLearning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems
We propose the use of sequences of separable, piecewise linear approximations for solving nondifferentiable stochastic optimization problems. The approximations are constructed adaptively using a combination of stochastic subgradient information and possibly sample information on the objective function itself. We prove the convergence of several versions of such methods when the objective funct...
متن کاملHedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our problems range from the graph-theoretic (shortest path, vertex cover, facility location) to set-theoretic (set cover, bin packing), and contain representatives with different approximation ratios. The approximation ratio of the s...
متن کاملSampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
We consider twoand multistage versions of stochastic combinatorial optimization problems with recourse: in this framework, the instance for the combinatorial optimization problem is drawn from a known probability distribution π and is only revealed to the algorithm over two (or multiple) stages. At each stage, on receiving some more information about the instance, the algorithm is allowed to bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Periodicals of Engineering and Natural Sciences (PEN)
سال: 2022
ISSN: ['2303-4521']
DOI: https://doi.org/10.21533/pen.v10i3.3040